Sojourn time tails in the single server queue with heavy-tailed service times

نویسندگان

  • Onno J. Boxma
  • Denis Denisov
چکیده

We consider the GI/GI/1 queue with regularly varying service requirement distribution of index −α. It is well known that, in the M/G/1 FCFS queue, the sojourn time distribution is also regularly varying, of index 1 − α, whereas in the case of LCFS or Processor Sharing, the sojourn time distribution is regularly varying of index −α. That raises the question whether there exist service disciplines that give rise to a regularly varying sojourn time distribution with any index −γ ∈ [−α, 1 − α]. In this paper that question is answered affirmatively.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sampling at a Random Time with a Heavy-Tailed Distribution∗

Let Sn = ξ1 + · · · + ξn be a sum of i.i.d. non-negative random variables, S0 = 0. We study the asymptotic behaviour of the probability P{X(T ) > n}, n→∞, where X(t) = max{n ≥ 0 : Sn ≤ t}, t ≥ 0, is the corresponding renewal process. The stopping time T has a heavy-tailed distribution and is independent of X(t). We treat two different approaches to the study: via the law of large numbers and by...

متن کامل

Customer sojourn time in GI/GI/1 feedback queue in the presence of heavy tails

We consider a single-server GI/GI/1 queueing system with feedback. We assume the service times distribution to be (intermediate) regularly varying. We find the tail asymptotics for a customer’s sojourn time in two regimes: the customer arrives in an empty system, and the customer arrives in the system in the stationary regime. In particular, in the case of Poisson input we use the branching pro...

متن کامل

The Foreground-Background Processor-Sharing Queue: a survey

We give an overview of the results in the literature on single-server queues with the Foreground-Background (FB) discipline. The FB discipline gives service to the customer that has received the least amount of service. This not so well-known discipline has some appealing features, and performs very well for heavy-tailed service times. We describe results on the stationary queue length, the max...

متن کامل

The Foregound-Background Processor Sharing Queue: an overview

We give an overview of the results in the literature on single-server queues with the FB discipline. The FB discipline gives service to the customer that has received the least amount of service. This not so well-known discipline has some appealing features, and performs well for heavy-tailed service times. We describe results on the queue length, sojourn time, and the influence of variability ...

متن کامل

Single Server Bulk Queue with Service Interruption, Two Phase Repairs and State Dependent Rates

This paper reports a study on a single server queue with bulk arrival and bulk service patterns wherein the incoming traffic depends on the state of the server which may be in operating or breakdown state. The repair of the breakdown server is performed in two phases. The operating duration of server, repair duration of both phases of repairing as well as job's inter-arrival times and service t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2011